Error Minimization of Multipole Expansion

نویسندگان

  • Shinichiro Ohnuki
  • Weng Cho Chew
چکیده

In this paper, we focus on the truncation error of the multipole expansion for the fast multipole method and the multilevel fast multipole algorithm. When the buffer size is large enough, the error can be controlled and minimized by using the conventional selection rules. On the other hand, if the buffer size is small, the conventional selection rules no longer hold, and the new approach which we have recently proposed is needed. However, this method is still not sufficient to minimize the error for small buffer cases. We clarify this fact and show that the information about the placement of true worst-case interaction is needed. A novel algorithm to minimize the truncation error is proposed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Multipole Boundary Element Method for 2-D Helmholtz Equation Problems and Its Error Analysis ?

In this paper, a kind of Fast Multipole Boundary Element Method (FM-BEM) based on series form expansion is presented to solve two-dimensional (2-D) Helmholtz equation problems. A theorem of multipole expansion is derived and proved for the fundamental solution, which demonstrates the error source and can be widely used in 2-D electromagnetics and acoustics problems. The truncation error is anal...

متن کامل

Improved Interpolation of Evanescent Plane Waves for Fast Multipole Methods

One way to implement a low-frequency or broadband fast multipole method is to use the spectral representation, or inhomogeneous plane-wave expansion, of the Green’s function. To significantly improve the error-controllability of the method, we propose a new interpolation and anterpolation scheme for the evanescent part. DOI: 10.2529/PIERS060907051636 The fast multipole method (FMM) can be used ...

متن کامل

A Multipole Based Treecode Using Spherical Harmonics for Potentials of the Form r-lambda

In this paper we describe an efficient algorithm for computing the potentials of the form r−λ where λ ≥ 1. This treecode algorithm uses spherical harmonics to compute multipole coefficients that are used to evaluate these potentials. The key idea in this algorithm is the use of Gegenbauer polynomials to represent r−λ in a manner analogous to the use of Legendre polynomials for the expansion of ...

متن کامل

Gravitational waves from binary systems in circular orbits: Convergence of a dressed multipole expansion

The gravitational radiation originating from a compact binary system in circular orbit is usually expressed as an infinite sum over radiative multipole moments. In a slow-motion approximation, each multipole moment is then expressed as a post-Newtonian expansion in powers of v/c, the ratio of the orbital velocity to the speed of light. The “bare multipole truncation” of the radiation consists i...

متن کامل

Multipole Analysis of Normal Mcg

This paper presents a multipole analysis of the QRS complex of the normal magnetocardiogram (MCG) of six normal subjects. The multipole strengths up to the octupole term were determined from the measured distribution of the z-component of the cardiac magnetic field (the component perpendicular to the frontal plane). This equivalent magnetic multipole generator was found to represent the cardiac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2005